package path.calculator;

import java.util.HashMap;
import java.util.LinkedList;
import java.util.List;

public class PathCalculator {
    private int nodeCount;

    HashMap<Character, String> keyCannotBeBefore = new HashMap<Character, String>();

    public PathCalculator(int nodeCount) {
        this.nodeCount = nodeCount;
    }

    public int totalPaths() {
        PermutationGenerator generator = new PermutationGenerator(nodeCount, keyCannotBeBefore);

        List<String> allPermutations = generator.validPermutations();

        List<String> validPermutations = new LinkedList<String>();

        for (String current : allPermutations)
            if (isValidPermutation(current))
                validPermutations.add(current);

        return validPermutations.size();
    }

    private boolean isValidPermutation(String current) {
//        for (int fromIndex = current.length() - 1; fromIndex > 0; --fromIndex)
//            for (int toIndex = fromIndex - 1; toIndex >= 0; --toIndex)
//                if (pathExistsBetween(current.charAt(toIndex), current.charAt(fromIndex)))
//                    return false;

        return true;
    }

    private boolean pathExistsBetween(char a, char b) {
        return keyCannotBeBefore.containsKey(a) && keyCannotBeBefore.get(a).indexOf(b) >= 0;
    }

    public void mustFlowFromNodeToNode(char previous, char latter) {
        if (!keyCannotBeBefore.containsKey(latter))
            keyCannotBeBefore.put(latter, "");

        keyCannotBeBefore.put(latter, keyCannotBeBefore.get(latter) + previous);
    }
}
